#include<bits/stdc++.h>

using namespace std;
using ll = long long;
const int maxn = 100;
int a[maxn];

//sort a[left,right]
//T(n)=T(n-1)+O(n)=>T(n)=O(n^2)
void bubble_sort(int a[], int left, int right) {
    if (left >= right)return;
    for (int j = left; j <= right - 1; j++) {
        if (a[j] > a[j + 1])swap(a[j], a[j + 1]);
    }
    bubble_sort(a, left, right - 1);
}

int main() {
    freopen("1571C.in", "r", stdin);
    int n = 10;
    for (int i = 0; i < n; i++)cin >> a[i];

    bubble_sort(a, 0, 9);

    for (int i = 0; i < n; i++) {
        cout << a[i] << endl;
    }
    return 0;
}
